Trace languages defined by regular string languages
نویسندگان
چکیده
منابع مشابه
Learning Parallel Systems by Regular Trace Languages
We study the problem of learning by examples the structure of regular trace languages, a useful formalization of systems or programs of concurrent operations. Negative results are showed about traces with empty and total concurrency, and we compare them with a positive result derived from a work by N. Abe, about trace languages generated by commutative regular languages.
متن کاملWeak $\omega$-Regular Trace Languages
Mazurkiewicz traces describe concurrent behaviors of distributed systems. Trace-closed word languages, which are “linearizations” of trace languages, constitute a weaker notion of concurrency but still give us tools to investigate the latter. In this vein, our contribution is twofold. Firstly, we develop definitions that allow classification of ω-regular trace languages in terms of the correspo...
متن کاملTOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES
We present a topological characterization for fuzzy regular languages: we show that there is a bijective correspondence between fuzzy regular languages and the set of all clopen fuzzy subsets with finite image in the induced fuzzy topological space of Stone space (Profinite space), and then we give a representation of closed fuzzy subsets in the induced fuzzy topological space via fuzzy regular...
متن کاملConsensus String Problem for Multiple Regular Languages
The consensus string (or center string, closest string) of a set S of strings is defined as a string which is within a radius r from all strings in S. It is well-known that the consensus string problem for a finite set of equal-length strings is NP-complete. We study the consensus string problem for multiple regular languages. We define the consensus string of languages L1, . . . , Lk to be wit...
متن کاملEfficient recognition of trace languages defined by repeat-until loops
A sequence of operations may be validly reordered, provided that only pairs of independent operations are commuted. Focusing on a program scheme, idealized as a local finite automaton, we consider the problem of checking whether a given string is a valid permutation of a word recognized by the automaton. Within the framework of trace theory, this is the word membership problem for rational trac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1986
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/1986200201031